Priority Pricing in Queues with a Continuous Distribution of Customer Valuations

نویسندگان

  • Sherwin Doroudi
  • Mustafa Akan
  • Mor Harchol-Balter
  • Jeremy Karp
  • Christian Borgs
  • Jennifer T. Chayes
چکیده

We consider a service provider facing a continuum of delay-sensitive strategic customers. The service provider maximizes revenue by charging customers for the privilege of joining an M/G/1 queue and assigning them service priorities. Each customer has a valuation for the service, with a waiting cost per unit time that is proportional to their valuation; customer types are drawn from a continuous distribution and are unobservable to the service provider. We illustrate how to find revenue-maximizing incentive-compatible priority pricing menus, where the firm charges higher prices for higher queueing priority. We show that our proposed priority pricing scheme is optimal across all incentive-compatible pricing policies whenever the customer valuation distribution is regular. We compute the resulting price menus and priority allocations in closed form when customer valuations are drawn from Exponential, Uniform, or Pareto distributions. We find revenues in closed form for the special case of the M/M/1 queue, and compute revenues in the more general setting numerically. We compare our priority pricing scheme to the best fixed pricing scheme, as well as an idealized pricing scheme where customers always reveal their valuation. We observe the impact of service requirement variability on revenue and prices. We also illustrate how to create the optimal discrete priority pricing menu when the service provider is restricted to offering a finite number of priority classes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Priority Pricing in Queues with a Continuous Distribution of Customer Valuations (CMU-CS-13-109)

We consider a service provider facing a continuum of delay-sensitive strategic customers. The service provider maximizes revenue by charging customers for the privilege of joining an M/G/1 queue and assigning them service priorities. Each customer has a valuation for the service, with a waiting cost per unit time that is proportional to their valuation; customer types are drawn from a continuou...

متن کامل

“Coverage, Coarseness and Classification: Determinants of Social Efficiency in Priority Queues”

Many service providers utilize priority queues. Many consumers revile priority queues. However, some form of priority service may be necessary to maximize social welfare. Consequently, it is useful to understand how the priority scheme chosen by a revenue-maximizing firm differs from that a social planner would impose. We examine this in a single server-queue with customers that draw their valu...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

A Polling Model with Multiple Priority Levels

In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority level that is assigned to each customer at his arrival. For this situation the following service disciplines are considered: gated, exhaustive, and globally gate...

متن کامل

Dynamic Pricing with Periodic Review and a Finite set of Prices with Cancellation

In this paper, three dynamic pricing models are developed and analyzed. We assume a limited number of a particular asset is offered for sale over a period of time. This asset is perishable and can be an inventory or a manufacturing capacity. During each period, the seller sets a price for this asset. This price is selected from a predetermined discrete set. The maximum amount which a customer i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013